Building up hierarchical mathematical domains using functors in Theorema
نویسنده
چکیده
The world of mathematical domains is structured hierarchically. There are elementary domains and there are well– known techniques how to build up new domains from existing ones. Which of the domains to view as the actual basis of the hierarchy is the freedom of the mathematician who wants to work with these domains and it depends of course on the intention of their use. The strength of the concept lies, however, in the fact that a new domain is constructed from given domains by well– defined rules, which do not depend on the actually given domains but only rely on certain properties that hold in the given domains, and the construction rules guarantee certain properties for the new domain then. In Theorema, B. Buchberger introduced the concept of functors to represent these domain construction rules. A functor can actually be viewed as a function that produces a new domain from given domains by describing, which objects and operations are available in the new domain, and by defining, how new objects can be constructed from known objects and how operations on the new objects can be carried out using known operations in the underlying domains. Following the general philosophy of the Theorema system, functors play a role both in proving and in computing. The domain description contained in the functor holds structural information, which can be used by a prover for the new domain in order to find an appropriate structure of proofs for formulae containing objects of the new domain. The domain definitions, on the other hand, contain rules, which can be used by an evaluator for executing computations involving objects of the new domain. In the sequel, we will demonstrate the facilities that are provided in Theorema to define functors, to build up a hierarchy of domains using functors, and to do computations in the constructed domains. *) This reasearch work is supported by the Austrian Science Foundation (FWF) — project FO-1302 (SFB). *) This reasearch work is supported by the Austrian Science Foundation (FWF) — project FO-1302 (SFB). Functors in Theorema W. Windsteiger 2
منابع مشابه
A Symbolic Framework for Operations on Linear Boundary Problems
We describe a symbolic framework for treating linear boundary problems with a generic implementation in the Theorema system. For ordinary differential equations, the operations implemented include computing Green’s operators, composing boundary problems and integrodifferential operators, and factoring boundary problems. Based on our factorization approach, we also present some first steps for s...
متن کاملGroebner Bases in Theorema
In this talk we show how the theory of Groebner bases can be represented in the computer system Theorema, a system initiated by Bruno Buchberger in the mid-nineties. The main purpose of Theorema is to serve mathematical theory exploration and, in particular, automated reasoning. However, it is also an essential aspect of the Theorema philosophy that the system also provides good facilities for ...
متن کاملMathematical Theory Exploration in Theorema: Reduction Rings
In this paper we present the first-ever computer formalization of the theory of Gröbner bases in reduction rings, which is an important theory in computational commutative algebra, in Theorema. Not only the formalization, but also the formal verification of all results has already been fully completed by now; this, in particular, includes the generic implementation and correctness proof of Buch...
متن کاملPractical Aspects of Imperative Program Verification using Theorema
Approaching the problem of imperative program verification from a practical point of view has certain implications concerning [4]: the style of specifications, the programming language which is used, the help provided to the user for finding appropriate loop invariants, the theoretical frame used for formal verification, the language used for expressing generated verification theorems as well a...
متن کاملTheorema 2.0: Computer-Assisted Natural-Style Mathematics
The Theorema project aims at the development of a computer assistant for the working mathematician. Support should be given throughout all phases of mathematical activity, from introducing new mathematical concepts by definitions or axioms, through first (computational) experiments, the formulation of theorems, their justification by an exact proof, the application of a theorem as an algorithm,...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Electr. Notes Theor. Comput. Sci.
دوره 23 شماره
صفحات -
تاریخ انتشار 1999